An algebraic generalization of Kripke structures
نویسندگان
چکیده
منابع مشابه
Soft Neutrosophic Algebraic Structures and Their Generalization
Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been developed in many areas of mathematics. Algebraic structures using soft set theory are very rapidly developed. In this book we developed soft neutrosophic algebraic structures by...
متن کاملCSP and Kripke Structures
A runtime verification technique has been developed for CSP via translation of CSP models to Kripke structures. With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model. This complements analysis facilities available for CSP and for all languages with a CSP-based semantics: Safety-Critical Java, Simulink, SysML, and so on. Soundness...
متن کاملConcurrent Kripke Structures
We consider a class of Kripke Structures in which the atomic propositions are events. This enables us to represent worlds as sets of events and the transition and satisfaction relations of Kripke structures as the subset and membership relations on sets. We use this class, called event Kripke structures, to model concurrency. The obvious semantics for these structures is a true concurrency sema...
متن کاملAn Algebraic Generalization of Image J
As is well known, the image of J-homomorphism in the stable homotopy groups of spheres is described in terms of the first line of Adams-Novikov E2-term. In this paper we consider an algebraic analogue of the image J using the spectrum T (m)(j) defined by Ravenel and determine the Adams-Novikov first line for small values of j.
متن کاملWeak Kripke Structures and LTL
We revisit the complexity of the model checking problem for formulas of linear-time temporal logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a subclass of the Kripke frames, which is characterized by a simple structural condition: the model checking problem is only PSPACE-hard if there exists a strongly connected component with two distinct cycles. If no such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2008
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004108001667